Diicult Conngurations | on the Complexity of Ltrl
نویسنده
چکیده
The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also called connguration. The logic is shown to be non-elementary with the main reason for this complexity being the nesting of until operators in formulas. The fragment of the logic without the until operator is shown to be EXPSPACE-complete.
منابع مشابه
The Automata-Theoretic Approach Works for Global Trace Logics
A traditional approach towards automatic program veriication is model checking speciications in linear time temporal logic. The automata-theoretic approach has proven to be very simple and useful in solving this problem. EEcient (on{the{{y) algorithms for checking satissability of such speciications are then derived by constructing (e.g. B uchi, Streett or alternating) automata accepting the se...
متن کاملA ( non - elementary ) modular decision procedurefor
Thiagarajan and Walukiewicz 18] have deened a temporal logic LTrL on Mazurkiewicz traces, patterned on the famous proposi-tional temporal logic of linear time LTL deened by Pnueli. They have shown that this logic is equal in expressive power to the rst order theory of nite and innnite traces. The hopes to get an "easy" decision procedure for LTrL, as it is the case for LTL, vanished very recent...
متن کاملDifficult Configurations - On the Complexity of LTrL
The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also called configuration. The logic is shown to be non-elementary with the main reason for this complexity being the nesting of until operators in formulas. The fragment of the logic without the until operator is shown to be...
متن کاملP . Gastin , R . Meyer and A . Petit A ( non − elementary ) modular decision procedure for LTrL
Thiagarajan and Walukiewicz 17] have deened a temporal logic LTrL on Mazurkiewicz traces, patterned on the famous proposi-tional temporal logic of linear time LTL deened by Pnueli. They have shown that this logic is equal in expressive power to the rst order theory of nite and innnite traces. The hopes to get an "easy" decision procedure for LTrL, as it is the case for LTL, vanished very recent...
متن کاملThe Problem of
Let f(n) denote the number of conngurations of n 2 mutually non-attacking kings on a 2n 2n chessboard. We show that log f(n) grows like 2n log n 2n log 2, with an error term of O(n 4=5 log n). The result depends on an estimate for the sum of the entries of a high power of a matrix with positive entries. In chess, two kings can attack one another if their squares are horizontally, vertically, or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007